Dynamical process of a bit-width reduced Ising model with simulated annealing

نویسندگان

چکیده

Ising machines have attracted attention as fast and high-precision solvers for combinatorial optimization problems, which are often formulated ground-state (lowest-energy) search problems of the model. Since bit-width coefficients on is limited, model must be transformed into a reduced (BWR) reduces coefficients. In reduction method, adds auxiliary spins, ground state BWR theoretically same before (original model). However, dynamical process towards remains to elucidated. Therefore, using simulated annealing (SA), we compared processes these models. The result shows that differs significantly by Analysis from viewpoint statistical mechanics found has two characteristic properties: an effective temperature slow relaxation. It suggested properties alter spin flip probability in model, contributing differences. obtain original proposed SA parameters We demonstrated parameter square lattice interaction magnetic field were set uniformly positive values or randomly. As experimental evaluations, became closer

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Mushy State Simulated Annealing

It is a long time that the Simulated Annealing (SA) procedure has been introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules...

متن کامل

Compiling for Reduced Bit-Width Queue Processors

Embedded systems are characterized by the requirement of demanding small memory footprint code. A popular architectural modification to improve code density in RISC embedded processors is to use a reduced bit-width instruction set. This approach reduces the length of the instructions to improve code size. However, having less addressable registers by the reduced instructions, these architecture...

متن کامل

A Mushy State Simulated Annealing

It is a long time that the Simulated Annealing (SA) procedure is introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules start...

متن کامل

A Mushy State Simulated Annealing

It is a long time that the Simulated Annealing (SA) procedure is introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules start...

متن کامل

An Integrated Model of Project Scheduling and Material Ordering: A Hybrid Simulated Annealing and Genetic Algorithm

This study aims to deal with a more realistic combined problem of project scheduling and material ordering. The goal is to minimize the total material holding and ordering costs by determining the starting time of activities along with material ordering schedules subject to some constraints. The problem is first mathematically modelled. Then a hybrid simulated annealing and genetic algorithm is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3310875